Congruence Relations on Lattice Implication Algebras
نویسندگان
چکیده
منابع مشابه
Some Operations on Lattice Implication Algebras
We introduce the concept of a ⊗-closed set and a ⊗-homomorphism in lattice implication algebras, and we discuss some of their properties. Next, we introduce the fuzzy implicative filter and obtain equivalent conditions. Finally, we discuss the operation ⊗, fuzzy filters, and fuzzy implicative filters. 2000 Mathematics Subject Classification. 03G10, 06B10, 94D05.
متن کاملFilteristic Soft Lattice Implication Algebras
Applying the idea of soft set theory to lattice implication algebras, the novel concept of (implicative) filteristic soft lattice implication algebras which related to (implicative) filter(for short, (IF -)F -soft lattice implication algebras) are introduced. Basic properties of (IF -)F -soft lattice implication algebras are derived. Two kinds of fuzzy filters (i.e.(∈,∈ ∨qk)((∈,∈ ∨ qk))-fuzzy (...
متن کاملturkish-israeli relations and their implication on iranian national security
this dissertation has six chapter and tree appendices. chapter 1 introduces the thesis proposal including description of problem, key questions, hypothesis, backgrounds and review of literature, research objectives, methodology and theoretical concepts (key terms) taken the literature and facilitate an understanding of national security, national interest and turkish- israeli relations concepts...
15 صفحه اولQuotient Heyting Algebras Via Fuzzy Congruence Relations
This paper aims to introduce fuzzy congruence relations over Heyting algebras (HA) and give constructions of quotient Heyting algebras induced by fuzzy congruence relations on HA. The Fuzzy First, Second and Third Isomorphism Theorems of HA are established. MSC: 06D20, 06D72, 06D75.
متن کاملLattice decompositions through methods using congruence relations
During the last decade, the computation capabilities have promoted Formal Concept Analysis (FCA) with new methods based on concept lattices. Though they are exponential in space/time in worst case, concept lattices of a reasonable size enable an intuitive representation of data organized by a context that links objects to attributes through a binary relation. Methods based on concept lattices h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2011
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v3n2p17